منابع مشابه
Concentration inequalities for nonlinear matroid intersection
In this work we propose new randomized rounding algorithms for matroid intersection and matroid base polytopes. We prove concentration inequalities for polynomial objective functions and constraints that has numerous applications and can be used in approximation algorithms for Minimum Quadratic Spanning Tree, Unrelated Parallel Machines Scheduling and Scheduling with Time Windows and Nonlinear ...
متن کاملMatroid Prophet Inequalities and Bayesian Mechanism Design
Consider a gambler who observes a sequence of independent, non-negative random numbers and is allowed to stop the sequence at any time, claiming a reward equal to the most recent observation. The famous prophet inequality of Krengel, Sucheston, and Garling asserts that a gambler who knows the distribution of each random variable can achieve at least half as much reward, in expectation, as a "pr...
متن کاملMatroid Intersections, Polymatroid Inequalities, and Related Problems
Given m matroids M1, . . . ,Mm on the common ground set V , it is shown that all maximal subsets of V , independent in the m matroids, can be generated in quasi-polynomial time. More generally, given a system of polymatroid inequalities f1(X) ≥ t1, . . . , fm(X) ≥ tm with quasi-polynomially bounded right hand sides t1, . . . , tm, all minimal feasible solutions X ⊆ V to the system can be genera...
متن کاملMatroid Inequalities from Electrical Network Theory
In 1981, Stanley applied the Aleksandrov–Fenchel Inequalities to prove a logarithmic concavity theorem for regular matroids. Using ideas from electrical network theory we prove a generalization of this for the wider class of matroids with the “half–plane property”. Then we explore a nest of inequalities for weighted basis– generating polynomials that are related to these ideas. As a first resul...
متن کاملA note on some inequalities for the Tutte polynomial of a matroid
We prove that if a matroid M contains two disjoint bases (or, dually, if its ground set is the union of two bases), then TM (a, a) ≤ max{TM (2a, 0), TM (0, 2a)} for a ≥ 2. This resembles the conjecture that appears in C. Merino and D.J.A. Welsh, Forests, colourings and acyclic orientations of the square lattice, Annals of Combinatorics 3 (1999) pp. 417–429: If G is a 2-connected graph with no l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Mathematics
سال: 1980
ISSN: 0012-365X
DOI: 10.1016/0012-365x(80)90179-x